Intersecting curves
نویسنده
چکیده
Consider the graphs of n distinct polynomials of a real variable intersecting at some point. In the neighborhood of this point, the qualitative picture is described by some permutation of {1, . . . , n}. We describe the permutations that occur in such a situation. In this note, we shall examine the relative positions of the graphs of several functions in the neighborhood of a point where they intersect. In order to keep the discussion as elementary as possible, we shall restrict ourselves to polynomials in the real variable x f(x) = a0 + a1x+ . . .+ adx , where the coefficients ai are real numbers. As usual, one says that the valuation of f at 0 is the integer k ≤ d such that a0 = a1 = . . . = ak−1 = 0 and ak 6= 0 (and ∞ if f = 0). It is well known that the function f changes sign in the neighborhood of the origin if and only if its valuation is odd. Two curves Assume now that the graphs of two distinct polynomials f1, f2 intersect in some point, say the origin (0, 0). Then the relative position of the graphs of f1 and f2 in the neighborhood of this point is easy to describe. If the valuation of f1 − f2 is odd, these graphs cross each other. Otherwise they touch without crossing. Figure 1: Two intersecting curves
منابع مشابه
Surface/surface Intersections: a Three States Classification
Detecting intersecting surfaces and computing their intersection curves is one of the fundamental problems in solid modeling algebra. In this paper, we introduce a new strategy to classify surfaces against their intersection status. We replace exact geometric entities by fuzzy geometric ones. Intersecting surfaces are then replaced by fuzzy intersecting faces and their fuzzy intersection algori...
متن کاملArcs Intersecting at Most Once
We prove that on a punctured oriented surface with Euler characteristic χ < 0, the maximal cardinality of a set of essential simple arcs that are pairwise nonhomotopic and intersecting at most once is 2|χ|(|χ|+1). This gives a cubic estimate in |χ| for a set of curves pairwise intersecting at most once on a closed surface. We also give polynomial estimates in |χ| for sets of arcs and curves pai...
متن کاملSurfaces Intersection for Solids Algebra: a Classiication Algorithm
Detecting intersecting surfaces and computing their intersection curves is one of the fundamental problems in solid modeling algebra. This paper introduces a new strategy to classify surfaces against their intersection status, where exact geometric entities are replaced by fuzzy geometric ones. Intersecting surfaces are thus replaced by fuzzy intersecting faces and a fuzzy intersection algorith...
متن کاملA Generalized Scheme for the Interpolation of Arbitrarily Intersecting Curves by Catmull-Clark Subdivision Surfaces
This paper presents a scheme for interpolating intersecting uniform cubic B-spline curves by Catmull-Clark subdivision surfaces. The curves are represented by polygonal complexes and the neighborhoods of intersection points are modeled by X-Configurations. When these structures are embedded within a control polyhedron, the corresponding curves will automatically be interpolated by the surface l...
متن کاملA Subdivision Surface Interpolating Arbitrarily- Intersecting Network of Curves under Minimal Constraints
this paper presents an improved method for generating a hybrid Catmull-Clark subdivision surface that can interpolate an arbitrarily intersecting network of curves. Compared with our most recent work on this topic, the surface generation process is now simpler and altogether more intuitively appealing. Secondly, this method reduces to a bare minimum the set of constraints the surface requires t...
متن کاملConvex drawings of intersecting families of simple closed curves
A FISC or family of intersecting simple closed curves is a collection of simple closed curves in the plane with the properties that there is some open region common to the interiors of all the curves, and that every two curves intersect in nitely many points. Let F be a FISC. Intersections of the curves represent the vertices of a plane graph, G(F), whose edges are the curve arcs between vertic...
متن کامل